Implementation Relations for Testing Through Asynchronous Channels
نویسندگان
چکیده
منابع مشابه
Implementation Relations for Testing Through Asynchronous Channels
This paper concerns testing from an input output transition system (IOTS) model of a system under test that interacts with its environment through asynchronous first in first out (FIFO) channels. It explores methods for analysing an IOTS without modelling the channels. If IOTS M produces sequence σ then, since communications are asynchronous, output can be delayed and so a different sequence mi...
متن کاملBit Error Performance for Asynchronous Ds Cdma Systems Over Multipath Rayleigh Fading Channels (RESEARCH NOTE)
In recent years, there has been considerable interest in the use of CDMA in mobile communications. Bit error rate is one of the most important parameters in the evaluation of CDMA systems. In this paper, we develop a technique to find an accurate approximation to the probability of bit error for asynchronous direct–sequence code division multiple–access (DS/CDMA) systems by modeling the multipl...
متن کاملSpecification, testing and implementation relations for symbolic-probabilistic systems
We consider the specification and testing of systems where probabilistic information is not given by means of fixed values but as intervals of probabilities. We will use an extension of the finite state machines model where choices among transitions labelled by the same input action are probabilistically resolved. We will introduce our notion of test and we will define how tests are applied to ...
متن کاملAn implementation for complete asynchronous
We expand an acyclic distributed garbage collector (the cleanup protocol of Stub-Scion Pair Chains) with a detector of distributed cycles of garbage. The whole result is as a complete and asynchronous distributed garbage collector. The detection algorithm for free distributed cycles is inspired by Hughes 5]. A local collector marks outgoing references with dates, which are propagated asynchrono...
متن کاملTesting Theories for Asynchronous Languages
We study testing preorders for an asynchronous version of CCS called TACCS, where message emission is non blocking. We rst give a labelled transition system semantics for this language, which includes both external and internal choice operators. By applying the standard deenitions of may and must testing to this semantics we obtain two behavioural preorders based on asynchronous observations, <...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2012
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxs107